Search a number
-
+
399011021001 = 33127971119839
BaseRepresentation
bin1011100111001101110…
…10010000000011001001
31102010220202122000212000
411303212322100003021
523014133310133001
6503145250541213
740553602501215
oct5634672200311
91363822560760
10399011021001
1114424635688a
12653b7b97809
132b81b78c678
1415452ac3945
15a5a4b92a86
hex5ce6e900c9

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".

Divisors: 1 3 9 27 127 381 971 1143 2913 3429 8739 26217 119839 123317 359517 369951 1078551 1109853 3235653 3329559 15219553 45658659 116363669 136975977 349091007 410927931 1047273021 3141819063 14778185963 44334557889 133003673667 399011021001