Base | Representation |
---|---|
bin | 110000111000111000110010… |
… | …1101010100111001100010101 |
3 | 2002101121120012120000202222011 |
4 | 1201301301211222213030111 |
5 | 422331112002332322401 |
6 | 4122333304100104221 |
7 | 156402500225315503 |
oct | 14161614552471425 |
9 | 2071546176022864 |
10 | 430031011214101 |
11 | 115026144a43910 |
12 | 40292a83695071 |
13 | 155c499a6b761b |
14 | 782987d469673 |
15 | 34ab1606ca451 |
hex | 1871c65aa7315 |
430031011214101 has 16 divisors (see below), whose sum is σ = 485110122113088. Its totient is φ = 377836315084800.
The previous prime is 430031011214039. The next prime is 430031011214107. The reversal of 430031011214101 is 101412110130034.
It is not a de Polignac number, because 430031011214101 - 211 = 430031011212053 is a prime.
It is a super-2 number, since 2×4300310112141012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (430031011214107) 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, 5504569260 + ... + 5504647381.
It is an arithmetic number, because the mean of its divisors is an integer number (30319382632068).
Almost surely, 2430031011214101 is an apocalyptic number.
It is an amenable number.
430031011214101 is a deficient number, since it is larger than the sum of its proper divisors (55079110898987).
430031011214101 is a wasteful number, since it uses less digits than its factorization.
430031011214101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11009216772.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 430031011214101 its reverse (101412110130034), we get a palindrome (531443121344135).
The spelling of 430031011214101 in words is "four hundred thirty trillion, thirty-one billion, eleven million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •