Base | Representation |
---|---|
bin | 1100001101110111101010… |
… | …1111100011100100011001 |
3 | 1202120010102120211020101202 |
4 | 3003131322233203210121 |
5 | 3230034100014141101 |
6 | 44322434113123545 |
7 | 2554313640213215 |
oct | 303357257434431 |
9 | 52503376736352 |
10 | 13432422021401 |
11 | 43097270596a9 |
12 | 160b362b595b5 |
13 | 7658973b79b6 |
14 | 3461c0185945 |
15 | 18461c63036b |
hex | c377abe3919 |
13432422021401 has 8 divisors (see below), whose sum is σ = 13435602002784. Its totient is φ = 13429242349600.
The previous prime is 13432422021391. The next prime is 13432422021497. The reversal of 13432422021401 is 10412022423431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13432422021401 - 238 = 13157544114457 is a prime.
It is a super-2 number, since 2×134324220214012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13432422029401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102188546 + ... + 102319908.
It is an arithmetic number, because the mean of its divisors is an integer number (1679450250348).
Almost surely, 213432422021401 is an apocalyptic number.
It is an amenable number.
13432422021401 is a deficient number, since it is larger than the sum of its proper divisors (3179981383).
13432422021401 is a wasteful number, since it uses less digits than its factorization.
13432422021401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154791.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 13432422021401 its reverse (10412022423431), we get a palindrome (23844444444832).
The spelling of 13432422021401 in words is "thirteen trillion, four hundred thirty-two billion, four hundred twenty-two million, twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •