Base | Representation |
---|---|
bin | 1001010011011110000011… |
… | …0011110001010010101001 |
3 | 1100012222122110220022120121 |
4 | 2110313200303301102221 |
5 | 2320102210213040101 |
6 | 33431345442323241 |
7 | 2104046065022452 |
oct | 224674063612251 |
9 | 40188573808517 |
10 | 10230088799401 |
11 | 329461347a589 |
12 | 11927b0059521 |
13 | 5929020610c3 |
14 | 2751d3372129 |
15 | 12b194bd20a1 |
hex | 94de0cf14a9 |
10230088799401 has 27 divisors (see below), whose sum is σ = 10568461586277. Its totient is φ = 9902404296000.
The previous prime is 10230088799303. The next prime is 10230088799461. The reversal of 10230088799401 is 10499788003201.
The square root of 10230088799401 is 3198451.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 9177864191001 + 1052224608400 = 3029499^2 + 1025780^2 .
It is not a de Polignac number, because 10230088799401 - 217 = 10230088668329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10230088799461) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 23735704656 + ... + 23735705086.
Almost surely, 210230088799401 is an apocalyptic number.
10230088799401 is the 3198451-st square number.
10230088799401 is the 1599226-th centered octagonal number.
It is an amenable number.
10230088799401 is a deficient number, since it is larger than the sum of its proper divisors (338372786876).
10230088799401 is an frugal number, since it uses more digits than its factorization.
10230088799401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1306 (or 653 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 10230088799401 in words is "ten trillion, two hundred thirty billion, eighty-eight million, seven hundred ninety-nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •