Base | Representation |
---|---|
bin | 100001000010100101100111… |
… | …100100101101001010111111 |
3 | 201001111211012100011001120211 |
4 | 201002211213210231022333 |
5 | 123021303233221413043 |
6 | 1233020012220453251 |
7 | 42415354451562646 |
oct | 4102454744551277 |
9 | 631454170131524 |
10 | 145313366201023 |
11 | 423350639aa729 |
12 | 1436a8543aa227 |
13 | 6310cb7811647 |
14 | 27c52c102835d |
15 | 11bee02a57a9d |
hex | 84296792d2bf |
145313366201023 has 16 divisors (see below), whose sum is σ = 153345224010240. Its totient is φ = 137319897456000.
The previous prime is 145313366200967. The next prime is 145313366201027. The reversal of 145313366201023 is 320102663313541.
145313366201023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 145313366201023 - 217 = 145313366069951 is a prime.
It is a super-2 number, since 2×1453133662010232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145313366201027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 763381968 + ... + 763572298.
It is an arithmetic number, because the mean of its divisors is an integer number (9584076500640).
Almost surely, 2145313366201023 is an apocalyptic number.
145313366201023 is a deficient number, since it is larger than the sum of its proper divisors (8031857809217).
145313366201023 is a wasteful number, since it uses less digits than its factorization.
145313366201023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290958.
The product of its (nonzero) digits is 233280, while the sum is 40.
The spelling of 145313366201023 in words is "one hundred forty-five trillion, three hundred thirteen billion, three hundred sixty-six million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •