Base | Representation |
---|---|
bin | 1001000110110000010011… |
… | …11011001001001111010000 |
3 | 2121220012122111010001102200 |
4 | 10203120021323021033100 |
5 | 10111030211313030412 |
6 | 110330325012243200 |
7 | 4134431066026503 |
oct | 443301173111720 |
9 | 77805574101380 |
10 | 20023304033232 |
11 | 641a921136135 |
12 | 22b4798010500 |
13 | b23260353706 |
14 | 4d31c128d13a |
15 | 24acbabee9dc |
hex | 123609ec93d0 |
20023304033232 has 30 divisors (see below), whose sum is σ = 56037441148962. Its totient is φ = 6674434677696.
The previous prime is 20023304033219. The next prime is 20023304033263. The reversal of 20023304033232 is 23233040332002.
20023304033232 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 330 + 4 + 0 + 3 + 323 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 14323166883216 + 5700137150016 = 3784596^2 + 2387496^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20023304033196 and 20023304033205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 69525361083 + ... + 69525361370.
Almost surely, 220023304033232 is an apocalyptic number.
It is an amenable number.
20023304033232 is an abundant number, since it is smaller than the sum of its proper divisors (36014137115730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20023304033232 is a wasteful number, since it uses less digits than its factorization.
20023304033232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139050722467 (or 139050722458 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 27.
Adding to 20023304033232 its reverse (23233040332002), we get a palindrome (43256344365234).
The spelling of 20023304033232 in words is "twenty trillion, twenty-three billion, three hundred four million, thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •