Base | Representation |
---|---|
bin | 1110101111100011001011… |
… | …11111001001000110111001 |
3 | 11020210100000012100022222122 |
4 | 13113301211333021012321 |
5 | 13222132403243421101 |
6 | 152541333251531025 |
7 | 6554163620602346 |
oct | 727614577110671 |
9 | 136710005308878 |
10 | 32420124201401 |
11 | a36a32aa14642 |
12 | 37772a1bb9a75 |
13 | 1512287654921 |
14 | 8011dc9b57cd |
15 | 3b34c62a151b |
hex | 1d7c65fc91b9 |
32420124201401 has 4 divisors (see below), whose sum is σ = 32423415260304. Its totient is φ = 32416833142500.
The previous prime is 32420124201371. The next prime is 32420124201473. The reversal of 32420124201401 is 10410242102423.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 32420124201401 - 230 = 32419050459577 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (32420124201601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1645514675 + ... + 1645534376.
It is an arithmetic number, because the mean of its divisors is an integer number (8105853815076).
Almost surely, 232420124201401 is an apocalyptic number.
It is an amenable number.
32420124201401 is a deficient number, since it is larger than the sum of its proper divisors (3291058903).
32420124201401 is an equidigital number, since it uses as much as digits as its factorization.
32420124201401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3291058902.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 32420124201401 its reverse (10410242102423), we get a palindrome (42830366303824).
The spelling of 32420124201401 in words is "thirty-two trillion, four hundred twenty billion, one hundred twenty-four million, two hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •