Base | Representation |
---|---|
bin | 1111001100000110001110… |
… | …11001101110101010010111 |
3 | 11101021002211220002211102102 |
4 | 13212003013121232222113 |
5 | 13334220232320320112 |
6 | 155012113534232315 |
7 | 10015100122654502 |
oct | 746030731565227 |
9 | 141232756084372 |
10 | 33401011104407 |
11 | a708320007901 |
12 | 38b540b05569b |
13 | 1583917c04acb |
14 | 836890844139 |
15 | 3cdc84a8cbc2 |
hex | 1e60c766ea97 |
33401011104407 has 8 divisors (see below), whose sum is σ = 33417530343120. Its totient is φ = 33384492377280.
The previous prime is 33401011104403. The next prime is 33401011104427. The reversal of 33401011104407 is 70440111010433.
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 33401011104407 - 22 = 33401011104403 is a prime.
It is a super-2 number, since 2×334010111044072 (a number of 28 digits) contains 22 as substring.
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 33401011104407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33401011104401) 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, 243782573 + ... + 243919545.
It is an arithmetic number, because the mean of its divisors is an integer number (4177191292890).
Almost surely, 233401011104407 is an apocalyptic number.
33401011104407 is a deficient number, since it is larger than the sum of its proper divisors (16519238713).
33401011104407 is a wasteful number, since it uses less digits than its factorization.
33401011104407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255793.
The product of its (nonzero) digits is 4032, while the sum is 29.
The spelling of 33401011104407 in words is "thirty-three trillion, four hundred one billion, eleven million, one hundred four thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •