Base | Representation |
---|---|
bin | 1001001101111101100000… |
… | …1001011110100000000111 |
3 | 1022212221101020020021200201 |
4 | 2103133120021132200013 |
5 | 2312024402234323101 |
6 | 33320055142551331 |
7 | 2064156001226530 |
oct | 223373011364007 |
9 | 38787336207621 |
10 | 10135454214151 |
11 | 3258470744a52 |
12 | 117839b138547 |
13 | 586a000027b6 |
14 | 2707b6b33687 |
15 | 1289a6a2ee01 |
hex | 937d825e807 |
10135454214151 has 8 divisors (see below), whose sum is σ = 11589702516224. Its totient is φ = 8682787479960.
The previous prime is 10135454214131. The next prime is 10135454214157. The reversal of 10135454214151 is 15141245453101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10135454214151 - 27 = 10135454214023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10135454214151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10135454214157) 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, 395378235 + ... + 395403868.
It is an arithmetic number, because the mean of its divisors is an integer number (1448712814528).
Almost surely, 210135454214151 is an apocalyptic number.
10135454214151 is a deficient number, since it is larger than the sum of its proper divisors (1454248302073).
10135454214151 is an equidigital number, since it uses as much as digits as its factorization.
10135454214151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790783941.
The product of its (nonzero) digits is 48000, while the sum is 37.
Adding to 10135454214151 its reverse (15141245453101), we get a palindrome (25276699667252).
The spelling of 10135454214151 in words is "ten trillion, one hundred thirty-five billion, four hundred fifty-four million, two hundred fourteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •