Base | Representation |
---|---|
bin | 10010001100001110100011… |
… | …11010001111000110100011 |
3 | 12020122012120122012202021000 |
4 | 21012013101322033012203 |
5 | 20220400211321211003 |
6 | 221024530241203043 |
7 | 11266042350566556 |
oct | 1106072172170643 |
9 | 166565518182230 |
10 | 40002552132003 |
11 | 11822a948a567a |
12 | 45a0919930483 |
13 | 19422bc24a846 |
14 | 9c41c341a69d |
15 | 495858ce41a3 |
hex | 2461d1e8f1a3 |
40002552132003 has 16 divisors (see below), whose sum is σ = 59263314142240. Its totient is φ = 26668244812032.
The previous prime is 40002552131999. The next prime is 40002552132017. The reversal of 40002552132003 is 30023125520004.
It is a happy number.
40002552132003 is a `hidden beast` number, since 400 + 0 + 2 + 5 + 52 + 1 + 3 + 200 + 3 = 666.
It is not a de Polignac number, because 40002552132003 - 22 = 40002552131999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40002552132073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2725575 + ... + 9350607.
It is an arithmetic number, because the mean of its divisors is an integer number (3703957133890).
Almost surely, 240002552132003 is an apocalyptic number.
40002552132003 is a deficient number, since it is larger than the sum of its proper divisors (19260762010237).
40002552132003 is a wasteful number, since it uses less digits than its factorization.
40002552132003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6848675 (or 6848669 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
Adding to 40002552132003 its reverse (30023125520004), we get a palindrome (70025677652007).
The spelling of 40002552132003 in words is "forty trillion, two billion, five hundred fifty-two million, one hundred thirty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •