Base | Representation |
---|---|
bin | 1101101100001001101101… |
… | …00111000111111011001001 |
3 | 10221120221120100120201122121 |
4 | 12312010312213013323021 |
5 | 12421212143023102101 |
6 | 144005424354251241 |
7 | 6224652441651601 |
oct | 666046647077311 |
9 | 127527510521577 |
10 | 30104342003401 |
11 | 96571a8273616 |
12 | 346250b286b21 |
13 | 13a4a9a686873 |
14 | 7610b4d49c01 |
15 | 37313a2e30a1 |
hex | 1b61369c7ec9 |
30104342003401 has 4 divisors (see below), whose sum is σ = 30118589209492. Its totient is φ = 30090094797312.
The previous prime is 30104342003399. The next prime is 30104342003441. The reversal of 30104342003401 is 10430024340103.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14248933850176 + 15855408153225 = 3774776^2 + 3981885^2 .
It is a cyclic number.
It is not a de Polignac number, because 30104342003401 - 21 = 30104342003399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30104342003441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7123599876 + ... + 7123604101.
It is an arithmetic number, because the mean of its divisors is an integer number (7529647302373).
Almost surely, 230104342003401 is an apocalyptic number.
It is an amenable number.
30104342003401 is a deficient number, since it is larger than the sum of its proper divisors (14247206091).
30104342003401 is a wasteful number, since it uses less digits than its factorization.
30104342003401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14247206090.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 30104342003401 its reverse (10430024340103), we get a palindrome (40534366343504).
The spelling of 30104342003401 in words is "thirty trillion, one hundred four billion, three hundred forty-two million, three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •