Base | Representation |
---|---|
bin | 10100011000001100100… |
… | …100011101000111101001 |
3 | 11221212121012121222221221 |
4 | 110120030210131013221 |
5 | 140420424234042140 |
6 | 2551153213502041 |
7 | 203113323325111 |
oct | 24301444350751 |
9 | 4855535558857 |
10 | 1400370221545 |
11 | 49a991534209 |
12 | 1a74991a1921 |
13 | a2092520289 |
14 | 4bac785c041 |
15 | 266608e014a |
hex | 1460c91d1e9 |
1400370221545 has 8 divisors (see below), whose sum is σ = 1683894873024. Its totient is φ = 1117995772464.
The previous prime is 1400370221501. The next prime is 1400370221557. The reversal of 1400370221545 is 5451220730041.
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 1400370221545 - 27 = 1400370221417 is a prime.
It is a super-2 number, since 2×14003702215452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1400370221545.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 287547919 + ... + 287552788.
It is an arithmetic number, because the mean of its divisors is an integer number (210486859128).
Almost surely, 21400370221545 is an apocalyptic number.
It is an amenable number.
1400370221545 is a deficient number, since it is larger than the sum of its proper divisors (283524651479).
1400370221545 is an equidigital number, since it uses as much as digits as its factorization.
1400370221545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575101199.
The product of its (nonzero) digits is 33600, while the sum is 34.
Adding to 1400370221545 its reverse (5451220730041), we get a palindrome (6851590951586).
The spelling of 1400370221545 in words is "one trillion, four hundred billion, three hundred seventy million, two hundred twenty-one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •