Base | Representation |
---|---|
bin | 1001001101111101011000… |
… | …1100000111000110111010 |
3 | 1022212221021221101122000011 |
4 | 2103133112030013012322 |
5 | 2312024320331202310 |
6 | 33320052010332134 |
7 | 2064155122002613 |
oct | 223372614070672 |
9 | 38787257348004 |
10 | 10135421350330 |
11 | 3258454138971 |
12 | 117839012a04a |
13 | 5869c6267153 |
14 | 2707b261ac0a |
15 | 1289a3bdc78a |
hex | 937d63071ba |
10135421350330 has 16 divisors (see below), whose sum is σ = 18244278842400. Its totient is φ = 4054052893072.
The previous prime is 10135421350319. The next prime is 10135421350337. The reversal of 10135421350330 is 3305312453101.
It is a happy number.
It is a super-2 number, since 2×101354213503302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10135421350292 and 10135421350301.
It is not an unprimeable number, because it can be changed into a prime (10135421350337) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 14087344 + ... + 14789323.
It is an arithmetic number, because the mean of its divisors is an integer number (1140267427650).
Almost surely, 210135421350330 is an apocalyptic number.
10135421350330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10135421350330 is a deficient number, since it is larger than the sum of its proper divisors (8108857492070).
10135421350330 is a wasteful number, since it uses less digits than its factorization.
10135421350330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28911773.
The product of its (nonzero) digits is 16200, while the sum is 31.
The spelling of 10135421350330 in words is "ten trillion, one hundred thirty-five billion, four hundred twenty-one million, three hundred fifty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •