Base | Representation |
---|---|
bin | 1001101011111100001110… |
… | …01100110011011010001011 |
3 | 2210102100122002101020011001 |
4 | 10311332013030303122023 |
5 | 10242443432320220243 |
6 | 113145314401115431 |
7 | 4325642624641462 |
oct | 465760714633213 |
9 | 83370562336131 |
10 | 21301011101323 |
11 | 68727874a5658 |
12 | 2480341628b77 |
13 | bb68a4a04285 |
14 | 538d8dc039d9 |
15 | 26e14c931a4d |
hex | 135f8733368b |
21301011101323 has 8 divisors (see below), whose sum is σ = 22555488947040. Its totient is φ = 20046697388160.
The previous prime is 21301011101297. The next prime is 21301011101339. The reversal of 21301011101323 is 32310111010312.
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 21301011101323 - 217 = 21301010970251 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21301011101323.
It is not an unprimeable number, because it can be changed into a prime (21301011101353) 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, 40765888 + ... + 41285101.
It is an arithmetic number, because the mean of its divisors is an integer number (2819436118380).
Almost surely, 221301011101323 is an apocalyptic number.
21301011101323 is a deficient number, since it is larger than the sum of its proper divisors (1254477845717).
21301011101323 is a wasteful number, since it uses less digits than its factorization.
21301011101323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82066277.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 21301011101323 its reverse (32310111010312), we get a palindrome (53611122111635).
The spelling of 21301011101323 in words is "twenty-one trillion, three hundred one billion, eleven million, one hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •