Base | Representation |
---|---|
bin | 1101101001011010100110… |
… | …01000000001111100100001 |
3 | 10221020221220120111120210022 |
4 | 12310231103020001330201 |
5 | 12413142124231024301 |
6 | 143454320014443225 |
7 | 6215113660365020 |
oct | 664552310017441 |
9 | 127227816446708 |
10 | 30010331111201 |
11 | 96203455a9891 |
12 | 3448253203515 |
13 | 1398c678cb1bc |
14 | 75a7174a08b7 |
15 | 370986c8dd1b |
hex | 1b4b53201f21 |
30010331111201 has 8 divisors (see below), whose sum is σ = 34441025544960. Its totient is φ = 25615512746208.
The previous prime is 30010331111191. The next prime is 30010331111279. The reversal of 30010331111201 is 10211113301003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-30010331111201 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 30010331111201.
It is not an unprimeable number, because it can be changed into a prime (30010331111801) 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, 8969015396 + ... + 8969018741.
It is an arithmetic number, because the mean of its divisors is an integer number (4305128193120).
Almost surely, 230010331111201 is an apocalyptic number.
It is an amenable number.
30010331111201 is a deficient number, since it is larger than the sum of its proper divisors (4430694433759).
30010331111201 is a wasteful number, since it uses less digits than its factorization.
30010331111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17938034383.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 30010331111201 its reverse (10211113301003), we get a palindrome (40221444412204).
The spelling of 30010331111201 in words is "thirty trillion, ten billion, three hundred thirty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •