Base | Representation |
---|---|
bin | 100001011110001111110… |
… | …011000010000110110110 |
3 | 22010220021021210012211102 |
4 | 201132033303002012312 |
5 | 300141322311220342 |
6 | 4520412334010102 |
7 | 325120411411502 |
oct | 41361763020666 |
9 | 8126237705742 |
10 | 2300220023222 |
11 | 807577266860 |
12 | 31196b046932 |
13 | 138ba9b3b124 |
14 | 7d48cd07302 |
15 | 3ec79b4d832 |
hex | 2178fcc21b6 |
2300220023222 has 32 divisors (see below), whose sum is σ = 3770979287040. Its totient is φ = 1043615416480.
The previous prime is 2300220023203. The next prime is 2300220023251. The reversal of 2300220023222 is 2223200220032.
2300220023222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×23002200232222 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2300220023194 and 2300220023203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149755979 + ... + 149771337.
It is an arithmetic number, because the mean of its divisors is an integer number (117843102720).
Almost surely, 22300220023222 is an apocalyptic number.
2300220023222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2300220023222 is a deficient number, since it is larger than the sum of its proper divisors (1470759263818).
2300220023222 is a wasteful number, since it uses less digits than its factorization.
2300220023222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27556.
The product of its (nonzero) digits is 1152, while the sum is 20.
Adding to 2300220023222 its reverse (2223200220032), we get a palindrome (4523420243254).
The spelling of 2300220023222 in words is "two trillion, three hundred billion, two hundred twenty million, twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •