Base | Representation |
---|---|
bin | 100000010101010100111001… |
… | …001110110111001000110001 |
3 | 200122111110212211100222102211 |
4 | 200111110321032313020301 |
5 | 122114323302243303213 |
6 | 1222235100553012121 |
7 | 41644554464520544 |
oct | 4025247116671061 |
9 | 618443784328384 |
10 | 142203032400433 |
11 | 41345a70623594 |
12 | 13b47a979b4041 |
13 | 61468c45b0c04 |
14 | 271894089a85b |
15 | 1169061c8253d |
hex | 8155393b7231 |
142203032400433 has 16 divisors (see below), whose sum is σ = 154241064552960. Its totient is φ = 130573159948800.
The previous prime is 142203032400421. The next prime is 142203032400439. The reversal of 142203032400433 is 334004230302241.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 142203032400433 - 221 = 142203030303281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142203032400395 and 142203032400404.
It is not an unprimeable number, because it can be changed into a prime (142203032400439) 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, 196465288 + ... + 197187766.
It is an arithmetic number, because the mean of its divisors is an integer number (9640066534560).
Almost surely, 2142203032400433 is an apocalyptic number.
It is an amenable number.
142203032400433 is a deficient number, since it is larger than the sum of its proper divisors (12038032152527).
142203032400433 is a wasteful number, since it uses less digits than its factorization.
142203032400433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004928.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 142203032400433 its reverse (334004230302241), we get a palindrome (476207262702674).
The spelling of 142203032400433 in words is "one hundred forty-two trillion, two hundred three billion, thirty-two million, four hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •