Base | Representation |
---|---|
bin | 1100000110110100000101… |
… | …0110011001110111000001 |
3 | 1202010112112102021122220000 |
4 | 3001231001112121313001 |
5 | 3221042314202324213 |
6 | 44151025245310213 |
7 | 2542462642332006 |
oct | 301550126316701 |
9 | 52115472248800 |
10 | 13311200042433 |
11 | 4272280446707 |
12 | 15ab971b65369 |
13 | 757318cb2067 |
14 | 3403a082b8ad |
15 | 1813c524bc73 |
hex | c1b41599dc1 |
13311200042433 has 80 divisors (see below), whose sum is σ = 20733705341184. Its totient is φ = 8502613701120.
The previous prime is 13311200042401. The next prime is 13311200042443. The reversal of 13311200042433 is 33424000211331.
It is a happy number.
13311200042433 is a `hidden beast` number, since 1 + 3 + 3 + 1 + 1 + 200 + 0 + 424 + 33 = 666.
It is not a de Polignac number, because 13311200042433 - 25 = 13311200042401 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 13311200042397 and 13311200042406.
It is not an unprimeable number, because it can be changed into a prime (13311200042443) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 729092041 + ... + 729110297.
Almost surely, 213311200042433 is an apocalyptic number.
It is an amenable number.
13311200042433 is a deficient number, since it is larger than the sum of its proper divisors (7422505298751).
13311200042433 is a wasteful number, since it uses less digits than its factorization.
13311200042433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22004 (or 21995 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 13311200042433 its reverse (33424000211331), we get a palindrome (46735200253764).
The spelling of 13311200042433 in words is "thirteen trillion, three hundred eleven billion, two hundred million, forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •