Base | Representation |
---|---|
bin | 101011101100000010110… |
… | …110100111010001111000 |
3 | 101122000021120102120110010 |
4 | 223230002312213101320 |
5 | 343142031340323000 |
6 | 10215112212221520 |
7 | 426622026015633 |
oct | 53540266472170 |
9 | 11560246376403 |
10 | 3002230011000 |
11 | a58269633a80 |
12 | 405a2890a8a0 |
13 | 18a15583b53c |
14 | a5447146c1a |
15 | 531653dcd50 |
hex | 2bb02da7478 |
3002230011000 has 128 divisors (see below), whose sum is σ = 10218499349760. Its totient is φ = 727813328000.
The previous prime is 3002230010977. The next prime is 3002230011029. The reversal of 3002230011000 is 1100322003.
It is a happy number.
3002230011000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 45455334 + ... + 45521333.
It is an arithmetic number, because the mean of its divisors is an integer number (79832026170).
Almost surely, 23002230011000 is an apocalyptic number.
3002230011000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3002230011000 is an abundant number, since it is smaller than the sum of its proper divisors (7216269338760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3002230011000 is a wasteful number, since it uses less digits than its factorization.
3002230011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90976702 (or 90976688 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 3002230011000 its reverse (1100322003), we get a palindrome (3003330333003).
The spelling of 3002230011000 in words is "three trillion, two billion, two hundred thirty million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •