Base | Representation |
---|---|
bin | 101101101000001011100101… |
… | …0110110010100100100110101 |
3 | 1221122001100210011112100111120 |
4 | 1123100113022312110210311 |
5 | 410101130340241244110 |
6 | 3541332032022254153 |
7 | 150352223304604362 |
oct | 13320271266244465 |
9 | 1848040704470446 |
10 | 401346622212405 |
11 | 106977168177041 |
12 | 3901b7b7887359 |
13 | 142c3a9366850c |
14 | 71173cca99469 |
15 | 315ee300cc870 |
hex | 16d05cad94935 |
401346622212405 has 8 divisors (see below), whose sum is σ = 642154595539872. Its totient is φ = 214051531846608.
The previous prime is 401346622212299. The next prime is 401346622212413. The reversal of 401346622212405 is 504212226643104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 401346622212405 - 29 = 401346622211893 is a prime.
It is a super-2 number, since 2×4013466222124052 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
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, 13378220740399 + ... + 13378220740428.
It is an arithmetic number, because the mean of its divisors is an integer number (80269324442484).
Almost surely, 2401346622212405 is an apocalyptic number.
It is an amenable number.
401346622212405 is a deficient number, since it is larger than the sum of its proper divisors (240807973327467).
401346622212405 is a wasteful number, since it uses less digits than its factorization.
401346622212405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26756441480835.
The product of its (nonzero) digits is 552960, while the sum is 42.
Adding to 401346622212405 its reverse (504212226643104), we get a palindrome (905558848855509).
The spelling of 401346622212405 in words is "four hundred one trillion, three hundred forty-six billion, six hundred twenty-two million, two hundred twelve thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •