Base | Representation |
---|---|
bin | 10111001100010101111111… |
… | …110101110101110100101110 |
3 | 111101011102101222020001001022 |
4 | 113030111333311311310232 |
5 | 101332210301210230410 |
6 | 1000535402454014142 |
7 | 30325332302621351 |
oct | 2714257765656456 |
9 | 441142358201038 |
10 | 102003323133230 |
11 | 2a557403762162 |
12 | b534b16647352 |
13 | 44bbb44ccbc2c |
14 | 1b28db6b80298 |
15 | bbd5193be455 |
hex | 5cc57fd75d2e |
102003323133230 has 8 divisors (see below), whose sum is σ = 183605981639832. Its totient is φ = 40801329253288.
The previous prime is 102003323133211. The next prime is 102003323133301. The reversal of 102003323133230 is 32331323300201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
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 102003323133230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100166156652 + ... + 5100166156671.
It is an arithmetic number, because the mean of its divisors is an integer number (22950747704979).
Almost surely, 2102003323133230 is an apocalyptic number.
102003323133230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102003323133230 is a deficient number, since it is larger than the sum of its proper divisors (81602658506602).
102003323133230 is a wasteful number, since it uses less digits than its factorization.
102003323133230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10200332313330.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 102003323133230 its reverse (32331323300201), we get a palindrome (134334646433431).
The spelling of 102003323133230 in words is "one hundred two trillion, three billion, three hundred twenty-three million, one hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •