Base | Representation |
---|---|
bin | 10011010000001010111… |
… | …010010111100001010101 |
3 | 11200110222110000002100000 |
4 | 103100022322113201111 |
5 | 133134032422000041 |
6 | 2451443140441513 |
7 | 164404663643055 |
oct | 23201272274125 |
9 | 4613873002300 |
10 | 1323033000021 |
11 | 470105700aa7 |
12 | 1944b50a9299 |
13 | 979b8c6bc35 |
14 | 4806c5c7565 |
15 | 246360a2bb6 |
hex | 1340ae97855 |
1323033000021 has 24 divisors (see below), whose sum is σ = 1981882244160. Its totient is φ = 881997507072.
The previous prime is 1323033000007. The next prime is 1323033000077. The reversal of 1323033000021 is 1200003303231.
It is not a de Polignac number, because 1323033000021 - 214 = 1323032983637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1323032999958 and 1323033000003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323033000721) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 14329621 + ... + 14421653.
It is an arithmetic number, because the mean of its divisors is an integer number (82578426840).
Almost surely, 21323033000021 is an apocalyptic number.
It is an amenable number.
1323033000021 is a deficient number, since it is larger than the sum of its proper divisors (658849244139).
1323033000021 is an frugal number, since it uses more digits than its factorization.
1323033000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151207 (or 151195 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 1323033000021 its reverse (1200003303231), we get a palindrome (2523036303252).
The spelling of 1323033000021 in words is "one trillion, three hundred twenty-three billion, thirty-three million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •