Base | Representation |
---|---|
bin | 1111100001000101100100… |
… | …00000001110000110100001 |
3 | 11110211001101020200001022010 |
4 | 13300202302000032012201 |
5 | 13433024234342223013 |
6 | 200323305244503133 |
7 | 10121151042360543 |
oct | 760426200160641 |
9 | 143731336601263 |
10 | 34122206601633 |
11 | a966168076257 |
12 | 39b1141b4aaa9 |
13 | 1606930625487 |
14 | 85d748b0b693 |
15 | 3e28e480c7c3 |
hex | 1f08b200e1a1 |
34122206601633 has 32 divisors (see below), whose sum is σ = 47572878412800. Its totient is φ = 21713958826560.
The previous prime is 34122206601547. The next prime is 34122206601661. The reversal of 34122206601633 is 33610660222143.
It is not a de Polignac number, because 34122206601633 - 212 = 34122206597537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34122206601591 and 34122206601600.
It is not an unprimeable number, because it can be changed into a prime (34122206601433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 168738018 + ... + 168940116.
It is an arithmetic number, because the mean of its divisors is an integer number (1486652450400).
Almost surely, 234122206601633 is an apocalyptic number.
It is an amenable number.
34122206601633 is a deficient number, since it is larger than the sum of its proper divisors (13450671811167).
34122206601633 is a wasteful number, since it uses less digits than its factorization.
34122206601633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207189.
The product of its (nonzero) digits is 186624, while the sum is 39.
Adding to 34122206601633 its reverse (33610660222143), we get a palindrome (67732866823776).
The spelling of 34122206601633 in words is "thirty-four trillion, one hundred twenty-two billion, two hundred six million, six hundred one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •