Base | Representation |
---|---|
bin | 10001111001111001110… |
… | …000001011101000001010 |
3 | 11100121212220220210211120 |
4 | 101321321300023220022 |
5 | 130124331222222310 |
6 | 2341123421140110 |
7 | 154615353442632 |
oct | 21717160135012 |
9 | 4317786823746 |
10 | 1230403320330 |
11 | 4348a1663708 |
12 | 17a5636ba636 |
13 | 8c0463b4792 |
14 | 437a235d6c2 |
15 | 22013e31b70 |
hex | 11e79c0ba0a |
1230403320330 has 32 divisors (see below), whose sum is σ = 2994559072128. Its totient is φ = 323486318400.
The previous prime is 1230403320319. The next prime is 1230403320389. The reversal of 1230403320330 is 330233040321.
It is a happy number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1230403320330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 288824941 + ... + 288829200.
It is an arithmetic number, because the mean of its divisors is an integer number (93579971004).
Almost surely, 21230403320330 is an apocalyptic number.
1230403320330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1230403320330 is an abundant number, since it is smaller than the sum of its proper divisors (1764155751798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1230403320330 is a wasteful number, since it uses less digits than its factorization.
1230403320330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577654222.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 1230403320330 its reverse (330233040321), we get a palindrome (1560636360651).
The spelling of 1230403320330 in words is "one trillion, two hundred thirty billion, four hundred three million, three hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •