Base | Representation |
---|---|
bin | 111000110011111000… |
… | …1000101010101010001 |
3 | 102122220101112100210201 |
4 | 1301213301011111101 |
5 | 3444324000120213 |
6 | 132013535255201 |
7 | 11546162633056 |
oct | 1614761052521 |
9 | 378811470721 |
10 | 122000004433 |
11 | 4781590504a |
12 | 1b78967a501 |
13 | b673663748 |
14 | 5c94c0302d |
15 | 32908696dd |
hex | 1c67c45551 |
122000004433 has 8 divisors (see below), whose sum is σ = 129642821352. Its totient is φ = 114409003776.
The previous prime is 122000004431. The next prime is 122000004449. The reversal of 122000004433 is 334400000221.
It can be written as a sum of positive squares in 4 ways, for example, as 4880000449 + 117120003984 = 69857^2 + 342228^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122000004433 - 21 = 122000004431 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122000004433.
It is not an unprimeable number, because it can be changed into a prime (122000004431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12949210 + ... + 12958627.
It is an arithmetic number, because the mean of its divisors is an integer number (16205352669).
Almost surely, 2122000004433 is an apocalyptic number.
It is an amenable number.
122000004433 is a deficient number, since it is larger than the sum of its proper divisors (7642816919).
122000004433 is a wasteful number, since it uses less digits than its factorization.
122000004433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25908131.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 122000004433 its reverse (334400000221), we get a palindrome (456400004654).
The spelling of 122000004433 in words is "one hundred twenty-two billion, four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •