Base | Representation |
---|---|
bin | 1001011111010110111000… |
… | …1001000110101010001011 |
3 | 1100221111210221102011002110 |
4 | 2113311232021012222023 |
5 | 2331423443300123230 |
6 | 34105243443433403 |
7 | 2124566155604253 |
oct | 227655611065213 |
9 | 40844727364073 |
10 | 10434323442315 |
11 | 3363198619673 |
12 | 12062a9985863 |
13 | 5a8c4c798336 |
14 | 281049a06963 |
15 | 131649cca4b0 |
hex | 97d6e246a8b |
10434323442315 has 64 divisors (see below), whose sum is σ = 17503813780992. Its totient is φ = 5301774105600.
The previous prime is 10434323442307. The next prime is 10434323442331. The reversal of 10434323442315 is 51324432343401.
It is not a de Polignac number, because 10434323442315 - 23 = 10434323442307 is a prime.
It is a super-2 number, since 2×104343234423152 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 122582920 + ... + 122668010.
It is an arithmetic number, because the mean of its divisors is an integer number (273497090328).
Almost surely, 210434323442315 is an apocalyptic number.
10434323442315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10434323442315 is a deficient number, since it is larger than the sum of its proper divisors (7069490338677).
10434323442315 is a wasteful number, since it uses less digits than its factorization.
10434323442315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89820.
The product of its (nonzero) digits is 414720, while the sum is 39.
Adding to 10434323442315 its reverse (51324432343401), we get a palindrome (61758755785716).
The spelling of 10434323442315 in words is "ten trillion, four hundred thirty-four billion, three hundred twenty-three million, four hundred forty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •