Base | Representation |
---|---|
bin | 1011110110101000011101… |
… | …0101000100011000110110 |
3 | 1201010221222012110102100122 |
4 | 2331222013111010120312 |
5 | 3202013444003120342 |
6 | 43415211530011542 |
7 | 2513421606343505 |
oct | 275520725043066 |
9 | 51127865412318 |
10 | 13033201223222 |
11 | 4175393352154 |
12 | 1565b08876bb2 |
13 | 737044329a2b |
14 | 330b4b69683c |
15 | 1790543514d2 |
hex | bda87544636 |
13033201223222 has 32 divisors (see below), whose sum is σ = 19727174095200. Its totient is φ = 6457748226048.
The previous prime is 13033201223221. The next prime is 13033201223243. The reversal of 13033201223222 is 22232210233031.
13033201223222 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×130332012232222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13033201223191 and 13033201223200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033201223221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252003638 + ... + 252055350.
It is an arithmetic number, because the mean of its divisors is an integer number (616474190475).
Almost surely, 213033201223222 is an apocalyptic number.
13033201223222 is a deficient number, since it is larger than the sum of its proper divisors (6693972871978).
13033201223222 is a wasteful number, since it uses less digits than its factorization.
13033201223222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54320.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 13033201223222 its reverse (22232210233031), we get a palindrome (35265411456253).
The spelling of 13033201223222 in words is "thirteen trillion, thirty-three billion, two hundred one million, two hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •