Base | Representation |
---|---|
bin | 1001001110001111010010… |
… | …0110100010101110111010 |
3 | 1022220101200211020201120212 |
4 | 2103203310212202232322 |
5 | 2312114141000004002 |
6 | 33322204502551122 |
7 | 2064415160433164 |
oct | 223436446425672 |
9 | 38811624221525 |
10 | 10140226563002 |
11 | 325a49a5a3308 |
12 | 11792b14384a2 |
13 | 5872b0945263 |
14 | 270b0a895934 |
15 | 128b859b9352 |
hex | 938f49a2bba |
10140226563002 has 8 divisors (see below), whose sum is σ = 15360937269012. Its totient is φ = 5019914140000.
The previous prime is 10140226562989. The next prime is 10140226563161. The reversal of 10140226563002 is 20036562204101.
It can be written as a sum of positive squares in 2 ways, for example, as 9543162818401 + 597063744601 = 3089201^2 + 772699^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101402265630022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10140226563002.
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 3 ways as a sum of consecutive naturals, for example, 25099570499 + ... + 25099570902.
Almost surely, 210140226563002 is an apocalyptic number.
10140226563002 is a deficient number, since it is larger than the sum of its proper divisors (5220710706010).
10140226563002 is a wasteful number, since it uses less digits than its factorization.
10140226563002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50199141504.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 10140226563002 its reverse (20036562204101), we get a palindrome (30176788767103).
The spelling of 10140226563002 in words is "ten trillion, one hundred forty billion, two hundred twenty-six million, five hundred sixty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •