Base | Representation |
---|---|
bin | 100000010110010101010… |
… | …011111110000110001100 |
3 | 21212111221220120201202110 |
4 | 200112111103332012030 |
5 | 242410202300213200 |
6 | 4421122240024020 |
7 | 316415042565516 |
oct | 40262523760614 |
9 | 7774856521673 |
10 | 2223003132300 |
11 | 787852350825 |
12 | 2ba9bb302010 |
13 | 13182249b322 |
14 | 79845a36bb6 |
15 | 3cc5ab7eb50 |
hex | 205954fe18c |
2223003132300 has 144 divisors (see below), whose sum is σ = 6821562892032. Its totient is φ = 557731257600.
The previous prime is 2223003132293. The next prime is 2223003132341. The reversal of 2223003132300 is 32313003222.
It is a super-2 number, since 2×22230031323002 (a number of 25 digits) contains 22 as substring.
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 47 ways as a sum of consecutive naturals, for example, 2219874 + ... + 3061673.
It is an arithmetic number, because the mean of its divisors is an integer number (47371964528).
Almost surely, 22223003132300 is an apocalyptic number.
2223003132300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2223003132300 is an abundant number, since it is smaller than the sum of its proper divisors (4598559759732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2223003132300 is a wasteful number, since it uses less digits than its factorization.
2223003132300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5281648 (or 5281641 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 2223003132300 its reverse (32313003222), we get a palindrome (2255316135522).
The spelling of 2223003132300 in words is "two trillion, two hundred twenty-three billion, three million, one hundred thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •