Base | Representation |
---|---|
bin | 1001000110111101011000… |
… | …10010110101101101111111 |
3 | 2121220212202122202122202011 |
4 | 10203132230102311231333 |
5 | 10111134100204333043 |
6 | 110333445311512051 |
7 | 4135100036215345 |
oct | 443365422655577 |
9 | 77825678678664 |
10 | 20030323121023 |
11 | 64228a3237736 |
12 | 22b6016828627 |
13 | b23b0b5b07b7 |
14 | 4d3689577995 |
15 | 24b07c03959d |
hex | 1237ac4b5b7f |
20030323121023 has 8 divisors (see below), whose sum is σ = 20284048412480. Its totient is φ = 19776602252160.
The previous prime is 20030323120963. The next prime is 20030323121069. The reversal of 20030323121023 is 32012132303002.
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 20030323121023 - 233 = 20021733186431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20030323120985 and 20030323121003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20030323521023) 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, 8539411 + ... + 10629307.
It is an arithmetic number, because the mean of its divisors is an integer number (2535506051560).
Almost surely, 220030323121023 is an apocalyptic number.
20030323121023 is a deficient number, since it is larger than the sum of its proper divisors (253725291457).
20030323121023 is a wasteful number, since it uses less digits than its factorization.
20030323121023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2211297.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20030323121023 its reverse (32012132303002), we get a palindrome (52042455424025).
The spelling of 20030323121023 in words is "twenty trillion, thirty billion, three hundred twenty-three million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •