Base | Representation |
---|---|
bin | 10000110110010100001110… |
… | …010000101000111110001000 |
3 | 100201101000102200221202120012 |
4 | 100312110032100220332020 |
5 | 34203033440330013112 |
6 | 421333401042251052 |
7 | 21415433353320506 |
oct | 2066241620507610 |
9 | 321330380852505 |
10 | 74101310001032 |
11 | 2167a209750a76 |
12 | 83893b6956a88 |
13 | 324695383bcc2 |
14 | 1442745bcb676 |
15 | 887829c04022 |
hex | 43650e428f88 |
74101310001032 has 32 divisors (see below), whose sum is σ = 151088919050520. Its totient is φ = 33928739712000.
The previous prime is 74101310001013. The next prime is 74101310001067. The reversal of 74101310001032 is 23010001310147.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 66798484765156 + 7302825235876 = 8173034^2 + 2702374^2 .
It is a junction number, because it is equal to n+sod(n) for n = 74101310000989 and 74101310001007.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7363002719 + ... + 7363012782.
Almost surely, 274101310001032 is an apocalyptic number.
It is an amenable number.
74101310001032 is an abundant number, since it is smaller than the sum of its proper divisors (76987609049488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74101310001032 is a wasteful number, since it uses less digits than its factorization.
74101310001032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14726015561 (or 14726015557 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 74101310001032 its reverse (23010001310147), we get a palindrome (97111311311179).
The spelling of 74101310001032 in words is "seventy-four trillion, one hundred one billion, three hundred ten million, one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •