Base | Representation |
---|---|
bin | 100001100000000110100… |
… | …110110111001001101000 |
3 | 22011002102012112020202220 |
4 | 201200012212313021220 |
5 | 300204413102240240 |
6 | 4521342221154040 |
7 | 325220664231303 |
oct | 41400646671150 |
9 | 8132365466686 |
10 | 2302213321320 |
11 | 8083aa446160 |
12 | 3122266bb920 |
13 | 139136aa9b63 |
14 | 7d5db939b3a |
15 | 3ed44b3a5d0 |
hex | 218069b7268 |
2302213321320 has 64 divisors (see below), whose sum is σ = 7534516328640. Its totient is φ = 558112320000.
The previous prime is 2302213321231. The next prime is 2302213321351. The reversal of 2302213321320 is 231233122032.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 872049181 + ... + 872051820.
It is an arithmetic number, because the mean of its divisors is an integer number (117726817635).
Almost surely, 22302213321320 is an apocalyptic number.
2302213321320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2302213321320 is an abundant number, since it is smaller than the sum of its proper divisors (5232303007320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2302213321320 is a wasteful number, since it uses less digits than its factorization.
2302213321320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744101026 (or 1744101022 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 2302213321320 its reverse (231233122032), we get a palindrome (2533446443352).
The spelling of 2302213321320 in words is "two trillion, three hundred two billion, two hundred thirteen million, three hundred twenty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •