Base | Representation |
---|---|
bin | 1100101111100111111011… |
… | …1000011001011011111110 |
3 | 1211121120020010012000221120 |
4 | 3023321332320121123332 |
5 | 3314034203340024042 |
6 | 45445100044411410 |
7 | 2644233104041422 |
oct | 313717670313376 |
9 | 54546203160846 |
10 | 14012312033022 |
11 | 451265192a296 |
12 | 16a381ab46b66 |
13 | 7a848093a5a4 |
14 | 3662b16b2b82 |
15 | 19475bc57dec |
hex | cbe7ee196fe |
14012312033022 has 8 divisors (see below), whose sum is σ = 28024624066056. Its totient is φ = 4670770677672.
The previous prime is 14012312033009. The next prime is 14012312033099. The reversal of 14012312033022 is 22033021321041.
It is a sphenic number, since it is the product of 3 distinct primes.
14012312033022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14012312032983 and 14012312033001.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1167692669413 + ... + 1167692669424.
It is an arithmetic number, because the mean of its divisors is an integer number (3503078008257).
Almost surely, 214012312033022 is an apocalyptic number.
14012312033022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14012312033022 is a wasteful number, since it uses less digits than its factorization.
14012312033022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2335385338842.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 14012312033022 its reverse (22033021321041), we get a palindrome (36045333354063).
The spelling of 14012312033022 in words is "fourteen trillion, twelve billion, three hundred twelve million, thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •