Base | Representation |
---|---|
bin | 1001010011101001011101… |
… | …1101010011111000100001 |
3 | 1100020021120001000001210020 |
4 | 2110322113131103320201 |
5 | 2320124444201023210 |
6 | 33433013510024053 |
7 | 2104215034351002 |
oct | 224722735237041 |
9 | 40207501001706 |
10 | 10233153142305 |
11 | 3295946197785 |
12 | 1193306348029 |
13 | 592c9cb83262 |
14 | 2754043271a9 |
15 | 12b2c3c35770 |
hex | 94e97753e21 |
10233153142305 has 32 divisors (see below), whose sum is σ = 16755084724224. Its totient is φ = 5330354371776.
The previous prime is 10233153142301. The next prime is 10233153142321. The reversal of 10233153142305 is 50324135133201.
It is not a de Polignac number, because 10233153142305 - 22 = 10233153142301 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10233153142301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8000682 + ... + 9191148.
It is an arithmetic number, because the mean of its divisors is an integer number (523596397632).
Almost surely, 210233153142305 is an apocalyptic number.
10233153142305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10233153142305 is a deficient number, since it is larger than the sum of its proper divisors (6521931581919).
10233153142305 is a wasteful number, since it uses less digits than its factorization.
10233153142305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203845.
The product of its (nonzero) digits is 32400, while the sum is 33.
Adding to 10233153142305 its reverse (50324135133201), we get a palindrome (60557288275506).
The spelling of 10233153142305 in words is "ten trillion, two hundred thirty-three billion, one hundred fifty-three million, one hundred forty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •