Base | Representation |
---|---|
bin | 1011100111001101110… |
… | …10010000000011001001 |
3 | 1102010220202122000212000 |
4 | 11303212322100003021 |
5 | 23014133310133001 |
6 | 503145250541213 |
7 | 40553602501215 |
oct | 5634672200311 |
9 | 1363822560760 |
10 | 399011021001 |
11 | 14424635688a |
12 | 653b7b97809 |
13 | 2b81b78c678 |
14 | 15452ac3945 |
15 | a5a4b92a86 |
hex | 5ce6e900c9 |
399011021001 has 32 divisors (see below), whose sum is σ = 596400537600. Its totient is φ = 263638806480.
The previous prime is 399011020913. The next prime is 399011021039. The reversal of 399011021001 is 100120110993.
It is not a de Polignac number, because 399011021001 - 27 = 399011020873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (399011021701) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3269640 + ... + 3389478.
It is an arithmetic number, because the mean of its divisors is an integer number (18637516800).
Almost surely, 2399011021001 is an apocalyptic number.
It is an amenable number.
399011021001 is a deficient number, since it is larger than the sum of its proper divisors (197389516599).
399011021001 is a wasteful number, since it uses less digits than its factorization.
399011021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120946 (or 120940 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
Adding to 399011021001 its reverse (100120110993), we get a palindrome (499131131994).
The spelling of 399011021001 in words is "three hundred ninety-nine billion, eleven million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •