Base | Representation |
---|---|
bin | 101101010111111110110101… |
… | …1000011100110100101101001 |
3 | 1221100011112001111210012002000 |
4 | 1122233331223003212211221 |
5 | 404303141203314200433 |
6 | 3532505144311401213 |
7 | 150032325112333203 |
oct | 13257755303464551 |
9 | 1840145044705060 |
10 | 399120222021993 |
11 | 106198a3231a27a |
12 | 3892020a983209 |
13 | 14191b4c464444 |
14 | 707b743c1d773 |
15 | 31220760c7113 |
hex | 16aff6b0e6969 |
399120222021993 has 64 divisors (see below), whose sum is σ = 622023809433600. Its totient is φ = 252439154130240.
The previous prime is 399120222021959. The next prime is 399120222022003.
399120222021993 is a `hidden beast` number, since 39 + 91 + 2 + 0 + 2 + 220 + 219 + 93 = 666.
399120222021993 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 399120222021993 - 212 = 399120222017897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (399120222021953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 291835488 + ... + 293199918.
It is an arithmetic number, because the mean of its divisors is an integer number (9719122022400).
Almost surely, 2399120222021993 is an apocalyptic number.
It is an amenable number.
399120222021993 is a deficient number, since it is larger than the sum of its proper divisors (222903587411607).
399120222021993 is a wasteful number, since it uses less digits than its factorization.
399120222021993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368299 (or 1368293 counting only the distinct ones).
The product of its (nonzero) digits is 1889568, while the sum is 54.
The spelling of 399120222021993 in words is "three hundred ninety-nine trillion, one hundred twenty billion, two hundred twenty-two million, twenty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •