Base | Representation |
---|---|
bin | 1001100000011101101000… |
… | …0101101000110110101011 |
3 | 1101000022211110010211101010 |
4 | 2120013122011220312223 |
5 | 2332231341432423230 |
6 | 34122104124355003 |
7 | 2126140605566535 |
oct | 230073205506653 |
9 | 41008743124333 |
10 | 10453314342315 |
11 | 3370253479949 |
12 | 1209b099a5a63 |
13 | 5aa98809aa80 |
14 | 281d2bc92855 |
15 | 131dac1689b0 |
hex | 981da168dab |
10453314342315 has 64 divisors (see below), whose sum is σ = 18040142736000. Its totient is φ = 5138171228160.
The previous prime is 10453314342307. The next prime is 10453314342323. The reversal of 10453314342315 is 51324341335401.
It is an interprime number because it is at equal distance from previous prime (10453314342307) and next prime (10453314342323).
It is not a de Polignac number, because 10453314342315 - 23 = 10453314342307 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 853116729 + ... + 853128981.
It is an arithmetic number, because the mean of its divisors is an integer number (281877230250).
Almost surely, 210453314342315 is an apocalyptic number.
10453314342315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10453314342315 is a deficient number, since it is larger than the sum of its proper divisors (7586828393685).
10453314342315 is a wasteful number, since it uses less digits than its factorization.
10453314342315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18784.
The product of its (nonzero) digits is 259200, while the sum is 39.
Adding to 10453314342315 its reverse (51324341335401), we get a palindrome (61777655677716).
The spelling of 10453314342315 in words is "ten trillion, four hundred fifty-three billion, three hundred fourteen million, three hundred forty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.997 sec. • engine limits •