Base | Representation |
---|---|
bin | 1001001100100010111001… |
… | …1011101000101011011110 |
3 | 1022210121121011201100200022 |
4 | 2103020232123220223132 |
5 | 2311130044243324410 |
6 | 33300553453432142 |
7 | 2062335164014115 |
oct | 223105633505336 |
9 | 38717534640608 |
10 | 10111132011230 |
11 | 324911a4729a8 |
12 | 117373179b652 |
13 | 584625033653 |
14 | 26d54a7c4c7c |
15 | 1280315e6455 |
hex | 9322e6e8ade |
10111132011230 has 32 divisors (see below), whose sum is σ = 18225763577280. Its totient is φ = 4038738485760.
The previous prime is 10111132011133. The next prime is 10111132011247. The reversal of 10111132011230 is 3211023111101.
It is a super-2 number, since 2×101111320112302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10111132011199 and 10111132011208.
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, 31884191 + ... + 32199749.
It is an arithmetic number, because the mean of its divisors is an integer number (569555111790).
Almost surely, 210111132011230 is an apocalyptic number.
10111132011230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111132011230 is a deficient number, since it is larger than the sum of its proper divisors (8114631566050).
10111132011230 is a wasteful number, since it uses less digits than its factorization.
10111132011230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320084.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10111132011230 its reverse (3211023111101), we get a palindrome (13322155122331).
The spelling of 10111132011230 in words is "ten trillion, one hundred eleven billion, one hundred thirty-two million, eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •