Base | Representation |
---|---|
bin | 1011001000000011100000… |
… | …1110101011101111110110 |
3 | 1121022110112111221100002112 |
4 | 2302000320032223233312 |
5 | 3100411201104413220 |
6 | 42003433424011022 |
7 | 2401543253215610 |
oct | 262007016535766 |
9 | 47273474840075 |
10 | 12233010232310 |
11 | 3996a993a912a |
12 | 1456a0a460a72 |
13 | 6a974c92b8aa |
14 | 30411bc15db0 |
15 | 16331e3d45c5 |
hex | b20383abbf6 |
12233010232310 has 32 divisors (see below), whose sum is σ = 25165184792832. Its totient is φ = 4194152408160.
The previous prime is 12233010232297. The next prime is 12233010232319. The reversal of 12233010232310 is 1323201033221.
It is a super-2 number, since 2×122330102323102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12233010232319) 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 15 ways as a sum of consecutive naturals, for example, 17576609 + ... + 18259331.
It is an arithmetic number, because the mean of its divisors is an integer number (786412024776).
Almost surely, 212233010232310 is an apocalyptic number.
12233010232310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12233010232310 is an abundant number, since it is smaller than the sum of its proper divisors (12932174560522).
12233010232310 is a wasteful number, since it uses less digits than its factorization.
12233010232310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938708.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12233010232310 its reverse (1323201033221), we get a palindrome (13556211265531).
The spelling of 12233010232310 in words is "twelve trillion, two hundred thirty-three billion, ten million, two hundred thirty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •