Base | Representation |
---|---|
bin | 10101011100001011… |
… | …010101000001010001 |
3 | 2012102101122201110100 |
4 | 111130023111001101 |
5 | 334121423410113 |
6 | 14324214323013 |
7 | 1443326622651 |
oct | 253413250121 |
9 | 65371581410 |
10 | 23021310033 |
11 | 9843a24a67 |
12 | 4565959469 |
13 | 222b610957 |
14 | 1185678361 |
15 | 8eb11dd73 |
hex | 55c2d5051 |
23021310033 has 24 divisors (see below), whose sum is σ = 34409442600. Its totient is φ = 14814100224.
The previous prime is 23021310031. The next prime is 23021310041. The reversal of 23021310033 is 33001312032.
It can be written as a sum of positive squares in 4 ways, for example, as 17969938704 + 5051371329 = 134052^2 + 71073^2 .
It is not a de Polignac number, because 23021310033 - 21 = 23021310031 is a prime.
It is a super-2 number, since 2×230213100332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23021309988 and 23021310015.
It is not an unprimeable number, because it can be changed into a prime (23021310031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1093341 + ... + 1114197.
It is an arithmetic number, because the mean of its divisors is an integer number (1433726775).
Almost surely, 223021310033 is an apocalyptic number.
It is an amenable number.
23021310033 is a deficient number, since it is larger than the sum of its proper divisors (11388132567).
23021310033 is a wasteful number, since it uses less digits than its factorization.
23021310033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25121 (or 25118 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 23021310033 its reverse (33001312032), we get a palindrome (56022622065).
The spelling of 23021310033 in words is "twenty-three billion, twenty-one million, three hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •