Base | Representation |
---|---|
bin | 1001101111001010111101… |
… | …10101011010110100000011 |
3 | 2210210222010022021112001022 |
4 | 10313211132311122310003 |
5 | 10301303240234013243 |
6 | 113312312143300055 |
7 | 4336652252535161 |
oct | 467453665326403 |
9 | 83728108245038 |
10 | 21412003032323 |
11 | 6905863558152 |
12 | 24999585aa62b |
13 | bc41b28746a7 |
14 | 5404bca34231 |
15 | 271e96b64b68 |
hex | 13795ed5ad03 |
21412003032323 has 8 divisors (see below), whose sum is σ = 22762108488720. Its totient is φ = 20084213368800.
The previous prime is 21412003032319. The next prime is 21412003032377. The reversal of 21412003032323 is 32323030021412.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21412003032323 - 22 = 21412003032319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21412003032292 and 21412003032301.
It is not an unprimeable number, because it can be changed into a prime (21412003332323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5578946240 + ... + 5578950077.
It is an arithmetic number, because the mean of its divisors is an integer number (2845263561090).
Almost surely, 221412003032323 is an apocalyptic number.
21412003032323 is a deficient number, since it is larger than the sum of its proper divisors (1350105456397).
21412003032323 is a wasteful number, since it uses less digits than its factorization.
21412003032323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11157896437.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 21412003032323 its reverse (32323030021412), we get a palindrome (53735033053735).
The spelling of 21412003032323 in words is "twenty-one trillion, four hundred twelve billion, three million, thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •