Base | Representation |
---|---|
bin | 1001011001010010101000… |
… | …0100010100101011011110 |
3 | 1100120112210120121120200110 |
4 | 2112110222010110223132 |
5 | 2323222022120420410 |
6 | 33545330003110450 |
7 | 2114216363163111 |
oct | 226245204245336 |
9 | 40515716546613 |
10 | 10330102123230 |
11 | 3322a7638600a |
12 | 11aa062372426 |
13 | 59c180557266 |
14 | 279da00a0578 |
15 | 12da9a19e720 |
hex | 9652a114ade |
10330102123230 has 64 divisors (see below), whose sum is σ = 25107380213760. Its totient is φ = 2719682524416.
The previous prime is 10330102123217. The next prime is 10330102123307. The reversal of 10330102123230 is 3232120103301.
It is a super-2 number, since 2×103301021232302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10330102123197 and 10330102123206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50005834 + ... + 50211986.
It is an arithmetic number, because the mean of its divisors is an integer number (392302815840).
Almost surely, 210330102123230 is an apocalyptic number.
10330102123230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10330102123230 is an abundant number, since it is smaller than the sum of its proper divisors (14777278090530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10330102123230 is a wasteful number, since it uses less digits than its factorization.
10330102123230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227385.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10330102123230 its reverse (3232120103301), we get a palindrome (13562222226531).
The spelling of 10330102123230 in words is "ten trillion, three hundred thirty billion, one hundred two million, one hundred twenty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •