Base | Representation |
---|---|
bin | 1100110000110010110110… |
… | …0001111010100011001001 |
3 | 1211200111010121200021210000 |
4 | 3030030231201322203021 |
5 | 3314401400014140241 |
6 | 45502223343313213 |
7 | 2645544333111054 |
oct | 314145541724311 |
9 | 54614117607700 |
10 | 14032422021321 |
11 | 4520131452130 |
12 | 16a76b18ab809 |
13 | 7aa337045152 |
14 | 36725c429a9b |
15 | 19503749ceb6 |
hex | cc32d87a8c9 |
14032422021321 has 40 divisors (see below), whose sum is σ = 22869877925664. Its totient is φ = 8503669889280.
The previous prime is 14032422021307. The next prime is 14032422021323. The reversal of 14032422021321 is 12312022423041.
14032422021321 is a `hidden beast` number, since 1 + 4 + 0 + 3 + 2 + 422 + 0 + 213 + 21 = 666.
It is not a de Polignac number, because 14032422021321 - 27 = 14032422021193 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 (14032422021323) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8448486 + ... + 9972048.
Almost surely, 214032422021321 is an apocalyptic number.
14032422021321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14032422021321 is a deficient number, since it is larger than the sum of its proper divisors (8837455904343).
14032422021321 is a wasteful number, since it uses less digits than its factorization.
14032422021321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1533923 (or 1533914 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 14032422021321 its reverse (12312022423041), we get a palindrome (26344444444362).
The spelling of 14032422021321 in words is "fourteen trillion, thirty-two billion, four hundred twenty-two million, twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •