Base | Representation |
---|---|
bin | 1001001110100001110101… |
… | …0111111000010101111000 |
3 | 1022220212112211002121011110 |
4 | 2103220131113320111320 |
5 | 2312204340110140004 |
6 | 33324350524000320 |
7 | 2064652436232441 |
oct | 223503527702570 |
9 | 38825484077143 |
10 | 10145205552504 |
11 | 326161505a870 |
12 | 117a2609900a0 |
13 | 5878c53287a9 |
14 | 27105dc482c8 |
15 | 128d77b70589 |
hex | 93a1d5f8578 |
10145205552504 has 64 divisors (see below), whose sum is σ = 27671535665280. Its totient is φ = 3073994352000.
The previous prime is 10145205552499. The next prime is 10145205552509. The reversal of 10145205552504 is 40525550254101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10145205552499) and next prime (10145205552509).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145205552509) 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 15 ways as a sum of consecutive naturals, for example, 686994 + ... + 4556574.
It is an arithmetic number, because the mean of its divisors is an integer number (432367744770).
Almost surely, 210145205552504 is an apocalyptic number.
It is an amenable number.
10145205552504 is an abundant number, since it is smaller than the sum of its proper divisors (17526330112776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10145205552504 is a wasteful number, since it uses less digits than its factorization.
10145205552504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3879532 (or 3879528 counting only the distinct ones).
The product of its (nonzero) digits is 200000, while the sum is 39.
The spelling of 10145205552504 in words is "ten trillion, one hundred forty-five billion, two hundred five million, five hundred fifty-two thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •