Base | Representation |
---|---|
bin | 11110101101111100001… |
… | …11100011010100010110 |
3 | 10201220022120212112120010 |
4 | 33112332013203110112 |
5 | 114243033344410410 |
6 | 2124511534421050 |
7 | 136153125254031 |
oct | 17267607432426 |
9 | 3656276775503 |
10 | 1055456638230 |
11 | 377686836015 |
12 | 15067a361786 |
13 | 786b5679487 |
14 | 39127744018 |
15 | 1c6c51b2c20 |
hex | f5be1e3516 |
1055456638230 has 32 divisors (see below), whose sum is σ = 2614808706048. Its totient is φ = 272375906400.
The previous prime is 1055456638213. The next prime is 1055456638259. The reversal of 1055456638230 is 328366545501.
It is a super-2 number, since 2×10554566382302 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1055456638230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 567448876 + ... + 567450735.
It is an arithmetic number, because the mean of its divisors is an integer number (81712772064).
Almost surely, 21055456638230 is an apocalyptic number.
1055456638230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055456638230 is an abundant number, since it is smaller than the sum of its proper divisors (1559352067818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055456638230 is a wasteful number, since it uses less digits than its factorization.
1055456638230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134899652.
The product of its (nonzero) digits is 2592000, while the sum is 48.
The spelling of 1055456638230 in words is "one trillion, fifty-five billion, four hundred fifty-six million, six hundred thirty-eight thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •